A Design of Hierarchical Bloom Filter

Shifting Bloom filters use location offset to encode state values for a set of elements. In spite its novelty, classification error rate inherent shifting needs be improved. this paper, we design hierarchical bloom filter address issue. Firstly, elements in are partitioned into disjoint groups. Each group is assigned unique number. Then these numbers implicitly encoded by major filter(MShi ftBF). further associated with secondary filter(SShiftBF). State belonging some the corresponding SShiftBF separately. Compared standard filters, advantage structure proposed scheme that can improve both and false positive rate. Finally, provide theoretical analysis conduct simulation experiments demonstrate outperforms filters.